Coloring a geometric hypergraph defined by an arrangement of half-planes
نویسنده
چکیده
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
منابع مشابه
Coloring geometric hypergraph defined by an arrangement of half-planes
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
متن کاملColoring half-planes and bottomless rectangles
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings [4]. One of the most interesting type of regions to consider for this problem is that of the axis-parallel rectangles. We completely solve the problem for a special case of them, for bottomless rectangles. We also give an almos...
متن کاملEdge Colored Hypergraphic Arrangements
A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a generalized chromatic polynomial of the associated edge colored hypergraph. The main result of this paper supplies a sufficient condition for the existence of non-t...
متن کاملSMALLEST n-UNIFORM HYPERGRAPH WITH POSITIVE DISCREPANCY
A two-coloring of the vertices X of the hypergraph H = ( X , o °) by red and blue has discrepancy d if d is the largest difference between the number of red and blue points in any edge. A two-coloring is an equipartition of H if it has discrepancy 0, i.e., every edge is exactly half red and half blue. Letf(n) be the fewest number of edges in an n-uniform hypergraph (all edges have size n) havin...
متن کاملAlgorithmic Bounds on Hypergraph Coloring and Covering
Consider the coloring of a vertex-labelled r-uniform hypergraph G(V,E), where V is the vertex set of n labelled vertices, and E is the set of hyperedges. In case of proper bicoloring, given two colors, we need to assign each vertex with one of the colors so that none of the hyperedges is monochromatic. This may not always be possible. In such cases, we use multiple bicolorings to ensure that ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011